On Numerical Semigroups Generated by Generalized Arithmetic Sequences

نویسنده

  • GRETCHEN L. MATTHEWS
چکیده

Given a numerical semigroup S, let M(S) = S \{0} and (lM(S)− lM(S)) = {x ∈ N0 : x + lM(S) ⊆ lM(S)}. Define associated numerical semigroups B(S) := (M(S)−M(S)) and L(S) := ∪l=1(lM(S)− lM(S)). Set B0(S) = S, and for i ≥ 1, define Bi(S) := B(Bi−1(S)). Similarly, set L0(S) = S, and for i ≥ 1, define Li(S) := L(Li−1(S)). These constructions define two finite ascending chains of numerical semigroups S = B0(S) ⊆ B1(S) ⊆ · · · ⊆ Bβ(S)(S) = N0 and S = L0(S) ⊆ L1(S) ⊆ · · · ⊆ Lλ(S)(S) = N0. It has been shown that not all numerical semigroups S have the property that Bi(S) ⊆ Li(S) for all i ≥ 0. In this paper, we prove that if S is a numerical semigroup with a set of generators that form a generalized arithmetic sequence, then Bi(S) ⊆ Li(S) for all i ≥ 0. Moreover, we see that this containment is not necessarily satisfied if a set of generators of S form an almost arithmetic sequence. In addition, we characterize numerical semigroups generated by generalized arithmetic sequences that satisfy other semigroup properties, such as symmetric, pseudo-symmetric, and Arf.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chomp on numerical semigroups

We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furt...

متن کامل

Invariants of Generalized Arithmetic Numerical Semigroups

A generalized arithemtic numerical monoid is of the form S = 〈a, ah+d, ah+2d, . . . , ah+ xd〉 where the gcd(a, d) = 1 and a > x. Much is known for the arithmetic numerical monoid, when h = 1, due to known information for that specific monoid’s length set. Therefore, this paper will explore various invariants of the generalized arithmetic numerical monoid.

متن کامل

Frobenius numbers of generalized Fibonacci semigroups

The numerical semigroup generated by relatively prime positive integers a1, . . . , an is the set S of all linear combinations of a1, . . . , an with nonnegative integral coefficients. The largest integer which is not an element of S is called the Frobenius number of S. Recently, J. M. Maŕın, J. L. Ramı́rez Alfonśın, and M. P. Revuelta determined the Frobenius number of a Fibonacci semigroup, th...

متن کامل

On the generalized Feng-Rao numbers of numerical semigroups generated by intervals

We give some general results concerning the computation of the generalized Feng-Rao numbers of numerical semigroups. In the case of a numerical semigroup generated by an interval, a formula for the r Feng-Rao number is obtained.

متن کامل

On Numerical Experiments with Symmetric Semigroups Generated by Three Elements and Their Generalization

We give a simple explanation of numerical experiments of V. Arnold with two sequences of symmetric numerical semigroups, S(4, 6 + 4k, 87− 4k) and S(9, 3 + 9k, 85− 9k) generated by three elements. We present a generalization of these sequences by numerical semigroups S(r 1 , r1r2 + r 2 1k, r3 − r 2 1k), k ∈ Z, r1, r2, r3 ∈ Z , r1 ≥ 2 and gcd(r1, r2) = gcd(r1, r3) = 1, and calculate their univers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003